Lexicographic semigroupoids
نویسنده
چکیده
The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper-triangular matrix algebras. 0. Introduction Consider a Cantor space which is presented explicitly as an infinite product of finite topological spaces. The product presentation provides an equivalence relation R consisting of the pairs (x,y) of points x and y which disagree in at most finitely many coordinates. This equivalence relation supports a natural locally compact totally disconnected topology which makes R a principal groupoid. It is well-known that in the case of countable products such topological equivalence relations are classified by the generalised integer obtained from the formal product of the cardinalities of the component spaces. Furthermore, this classification is closely related to the classification of C*-algebras that are infinite tensor products of matrix algebras, the so-called UHF C*-algebras. See, for example, Renault [10] and Power [7]. In the present paper we consider antisymmetric topological binary relations which are the lexicographic topological subrelations arising from infinite products indexed by general countable linear orderings. These natural semigroupoids are classified and their automorphism groups determined. This and related results enable us to give applications to the classification of triangular operator algebras which are themselves lexicographic products in an algebraic sense. The binary relations may also be viewed as the (semigroupoid) lexicographic products of total orderings on finite sets, and in fact our methods are applicable to lexicographic products of connected antisymmetric finite partial orders. Although applications to approximately finite operator algebras provide our primary motivation, it seems clear that lexicographic subrelations are interesting in their own right. In § 1 we recall how the generalised integer associated with the presentation of the Cantor space gives a complete invariant for the associated approximately finite groupoid. In §2 we classify the lexicographic products in the case of indexing by a countable dense
منابع مشابه
Infinite-vertex Free Profinite Semigroupoids and Symbolic Dynamics
Some fundamental questions about infinite-vertex (free) profinite semigroupoids are clarified, putting in evidence differences with the finitevertex case. This is done with examples of free profinite semigroupoids generated by the graph of a subshift. It is also proved that for minimal subshifts, the infinite edges of such free profinite semigroupoids form a connected compact groupoid.
متن کاملAutomatic Rees Matrix Semigroups
We consider the preservation of the properties of automaticity and prefix-automaticity in Rees matrix semigroups over semigroupoids and small categories. Some of our results are new or improve upon existing results in the single-object case of Rees matrix semigroups over semigroups.
متن کاملUsing lexicographic parametric programming for identifying efficient hyperpalnes in DEA
This paper investigates a procedure for identifying all efficient hyperplanes of production possibility set (PPS). This procedure is based on a method which recommended by Pekka J. Korhonen[8]. He offered using of lexicographic parametric programming method for recognizing all efficient units in data envelopment analysis (DEA). In this paper we can find efficient hyperplanes, via using the para...
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملOn Lexicographic Products of Two Fuzzy Graphs
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...
متن کامل